On the use of the Hotelling's T2 statistic for the hierarchical clustering of hyperspectral data

نویسندگان

  • Miguel Angel Veganzones
  • Joana Frontera-Pons
  • Jocelyn Chanussot
  • Jean Philippe Ovarlez
چکیده

In this work we propose a hierarchical clustering methodology for hyperspectral data based on the Hotelling’s T 2 statistic. For each hypespectral sample data, the statistical sample mean is calculated using a window-based neighborhood. Then, the pairwise similarities between any two hyperspectral samples are computed in base to the Hotelling’s T 2 statistic. This statistic assumes a Gaussian distribution of the data while hyperspectral data have been proven to be long tailed distributed. In order to improve the statistic robustness we use a Fixed Point estimator, and compare it to the classical sample mean estimator. The similarities are then used to hierarchically cluster the hyperspectral data. We give some preliminary qualitative results of the proposed approach over the Indian Pines hyperspectral scene. Results show that the use of the Fixed Point estimator does not significantly affect the clustering results. Further work will be focused on the use of the robust Hotelling statistic.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Multivariate Quality Control Procedure in Multistage Production Systems

In this paper a multivariate quality control procedure is offered in which several correlated stages are present in production systems and in each stage there are several correlated control variable. Using Hotelling's T2 statistic, first, each stage is tested for being out of control. Then out of control variables are selected using Murphy's method. The remainder of the research involves evalua...

متن کامل

Graph Clustering by Hierarchical Singular Value Decomposition with Selectable Range for Number of Clusters Members

Graphs have so many applications in real world problems. When we deal with huge volume of data, analyzing data is difficult or sometimes impossible. In big data problems, clustering data is a useful tool for data analysis. Singular value decomposition(SVD) is one of the best algorithms for clustering graph but we do not have any choice to select the number of clusters and the number of members ...

متن کامل

Urban Vegetation Recognition Based on the Decision Level Fusion of Hyperspectral and Lidar Data

Introduction: Information about vegetation cover and their health has always been interesting to ecologists due to its importance in terms of habitat, energy production and other important characteristics of plants on the earth planet. Nowadays, developments in remote sensing technologies caused more remotely sensed data accessible to researchers. The combination of these data improves the obje...

متن کامل

Spectral-spatial classification of hyperspectral images by combining hierarchical and marker-based Minimum Spanning Forest algorithms

Many researches have demonstrated that the spatial information can play an important role in the classification of hyperspectral imagery. This study proposes a modified spectral–spatial classification approach for improving the spectral–spatial classification of hyperspectral images. In the proposed method ten spatial/texture features, using mean, standard deviation, contrast, homogeneity, corr...

متن کامل

Choosing the Best Hierarchical Clustering Technique Based on Principal Components Analysis for Suspended Sediment Load Estimation

1- INTRODUCTION The assessment of watershed sediment load is necessary for controling soil erosion and reducing the potential of sediment production. Different estimates of sediment amounts along with the lack of long-term measurements limits the accessibility to reliable data series of erosion rate and sediment yield. Therefore, the observed data of suspended sediment load could be used to ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013